Applications of MetiTarski in the Verification of Control and Hybrid Systems

نویسندگان

  • Behzad Akbarpour
  • Lawrence C. Paulson
چکیده

MetiTarski, an automatic proof procedure for inequalities on elementary functions, can be used to verify control and hybrid systems. We perform a stability analysis of control systems using Nichols plots, presenting an inverted pendulum and a magnetic disk drive reader system. Given a hybrid systems specified by a system of differential equations, we use Maple to obtain a problem involving the exponential and trigonometric functions, which MetiTarski can prove automatically.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Proof Procedures for Polynomials and Special Functions

The key prior items of work are the MetiTarski theorem prover (Cambridge) and the RAHD decision procedure (Edinburgh). RAHD1 is a proof procedure for polynomials over the reals, and MetiTarski additionally is tailored for handling special functions such as log, exp, sin and cos. Both systems are well beyond the first prototype stage, and both have already shown world-leading characteristics [1,...

متن کامل

Control Simulation and Experimental Verification of Maximum Power Point Tracking Based on RT-LAB (TECHNICAL NOTE)

The maximum power point tracking (MPPT) control in the Photovoltaic system is the key control technology, however present controller has the disadvantages of long development cycle, high cost and complex verification, and there are some disadvantages carrying out totally physical simulation or totally digital simulation of different control algorithms. This paper carried out design of hardware ...

متن کامل

Designing a hybrid quantum controller for strongly eigenstate controllable systems

 In this paper, a new quantum hybrid controller for controlling the strongly eigenstate controllable systems, is designed. For this purpose, a Lyapunov control law is implemented when the target state is in reachable set of the initial state. On the other hand, if the target state is not in the reachable set of the given initial state, based on Grover algorithm, a new interface state that the t...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

Verifying Hybrid Systems Involving Transcendental Functions

We explore uses of a link we have constructed between the KeYmaera hybrid systems theorem prover and the MetiTarski proof engine for problems involving special functions such as sin, cos, exp, etc. Transcendental functions arise in the specification of hybrid systems and often occur in the solutions of the differential equations that govern how the states of hybrid systems evolve over time. To ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009